Incremental Construction of k-Dominating Sets in Wireless Sensor Networks
نویسندگان
چکیده
Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new incremental local algorithm to construct a k-dominating set. The algorithm constructs a monotone family of dominating sets D1 ⊆ D2 . . . ⊆ Di . . . ⊆ Dk such that each Di is an i-dominating set. For unit disk graphs, the size of each of the resulting i-dominating sets is at most six times the optimal.
منابع مشابه
Distributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology
Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...
متن کاملQuasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملساخت توپولوژی انرژیآگاه با مکانیزم نگهداری در شبکه‌های حسگر بی‌سیم
Wireless sensor networks (WSN) is presented solution for the problem of low-cost and flexible monitoring event, especially in places with limited access or dangerous for humans. Wireless sensor networks are built from wireless devices with limited resources thus to Long-Term survival of the Network must use energy-efficient mechanisms, algorithms and protocols. one of th...
متن کاملApplication of Dominating Sets in Wireless Sensor Networks
Wireless sensor networks (WSNs) consists of spatially distributed autonomous sensor nodes to monitor physical or environmental conditions because of that they have widespread applications in human communities and existence world. Like other computer and telecommunication networks, wireless sensor networks are susceptible to regarding destructive threats and attacks and simple hardware of these ...
متن کاملConstruction of Virtual Backbone on Growth-Bounded Graph with Variable Transmission Range
Virtual backbone has been used extensively in various aspects for wireless ad hoc or sensor networks recently. We propose an approximation solution to construct a virtual backbone based on a more generalized and realistic model of polynomial bounded growth. A localized distributed algorithm of MCDS_GBG for computing a Minimum Connected Dominating Sets as backbone in the growth-bounded graph is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ad Hoc & Sensor Wireless Networks
دوره 5 شماره
صفحات -
تاریخ انتشار 2006